Automatically Inferring Database Schemas
نویسنده
چکیده
The goal of this research is to investigate the possibility of automatically inferring a database schema. Our motivation is to make the task of the database designer easier. We require the designer only to provide a picture of how s/he expects the database to be used. This is provided in the form of natural language queries which the database might be expected to answer. The system synthesises a schema from this information. The above problem can be viewed as a problem in learning. The inference method we are proposing incrementally constructs the schema. The central idea of the inference mechanism is that it exploits certain features occurring in natural languages, namely, the syntactic structure of sentences.
منابع مشابه
Automatically Inferring Sound Dataflow Functions from Dataflow Fact Schemas
In previous work, we presented a language called Rhodium for writing program analyses and transformations that could be checked for soundness automatically. In this work, we present an algorithm for automatically inferring sound flow functions given only a set of dataflow fact schemas. By generating the flow functions mechanically, our approach reduces the burden on compiler writers. This paper...
متن کاملHeterogeneous Databases: Inferring Relationships for Merging Component Schemas, and a Query Language
متن کامل
Inferring Complex Semantic Mappings Between Relational Tables and Ontologies from Simple Correspondences
There are many problems requiring a semantic account of a database schema. At its best, such an account consists of mapping formulas between the schema and a formal conceptual model or ontology (CM) of the domain. This paper describes the underlying principles, algorithms, and a prototype of a tool which infers such semantic mappings when given simple correspondences from table columns in a rel...
متن کاملNeT & CoT: Inferring XML Schemas from Relational World
With XML emerging as the data format of the Internet era, there is a substantial increase in the amount of data encoded in XML. However, the majority of everyday data is still stored and maintained in relational databases. Therefore, we expect the needs to convert such relational data into XML documents will grow substantially as well. Two conversion algorithms, called NeT and CoT, to translate...
متن کاملAn Approach for Matching Schemas of Heterogeneous Relational Databases
AbstrAct: Schema matching is a basic problem in many database application domains, such as data integration. The problem of schema matching can be formulated as follows, " given two schemas, S i and S j , find the most plausible correspondences between the elements of S i and S j , exploiting all available information, such as the schemas, instance data, and auxiliary sources " [24]. Given the ...
متن کامل